On even [2, b]-factors in graphs
نویسندگان
چکیده
For each even integer b ≥ 2 we prove that a graph G with n vertices has an even [2, b]-factor if G is 2-edge connected and each vertex of G has degree at least max{3, 2n b+2 }.
منابع مشابه
More on even [a, b]-factors in graphs
In this note we give a characterization of the complete bipartite graphs which have an even (odd) [a, b]-factor. For general graphs we prove that an a-edge connected graph G with n vertices and with δ(G) ≥ max{a + 1, an a+b + a − 2} has an even [a, b]-factor, where a and b are even and 2 ≤ a ≤ b. With regard to the edge-connectivity this result is slightly better than one of the similar results...
متن کاملOre-type conditions for the existence of even [2, b]-factors in graphs
For even b 2, an even [2, b]-factor is a spanning subgraph each of whose degree is even between 2 and b. The main result is the following: a 2-edge-connected graph G of order n has an even [2, b]factor if the degree sum of each pair of nonadjacent vertices in G is at least max{4n/(2 + b), 5}. These lower bounds are best possible in some sense. The condition “2-edge-connected” cannot be dropped....
متن کاملOn the bandwidth of Mobius graphs
Bandwidth labelling is a well known research area in graph theory. We provide a new proof that the bandwidth of Mobius ladder is 4, if it is not a $K_{4}$, and investigate the bandwidth of a wider class of Mobius graphs of even strips.
متن کاملOn the zero forcing number of some Cayley graphs
Let Γa be a graph whose each vertex is colored either white or black. If u is a black vertex of Γ such that exactly one neighbor v of u is white, then u changes the color of v to black. A zero forcing set for a Γ graph is a subset of vertices Zsubseteq V(Γ) such that if initially the vertices in Z are colored black and the remaining vertices are colored white, then Z changes the col...
متن کاملStability number and even [2, b]-factors in graphs
Let b, b ≥ 2, be an even integer. A spanning subgraph of a graph G whose vertices have even degrees belonging to the interval [2, b], is called an even [2, b]-factor of G. In this paper, we prove a sufficient condition for the existence of an even [2, b]-factor which involves the stability number, the minimum degree of G and the integer b.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 27 شماره
صفحات -
تاریخ انتشار 2003